Exploring the use of Reeb graphs in LOD generation
نویسندگان
چکیده
Level of detail was one of the fundamental solutions of simplification 3D scene. But some issues with this solution are present. For example the topology of the mesh is not kept. In this paper we introduce the Reeb graph in level of detail. Reeb graph is a topological extractor for graph. We extract the most important point of a mesh and use them as LOD. These points are representing by a skeleton call Reeb Graph. We make a related work on LOD, skeleton extraction and extraction of Reeb graph. After, we introduce our work. We define augmented LOD or LOD+. We present the results of the different solutions that we implement like: LOD 0, LOD +, and measure between LOD. LOD 0 is the lowest LOD in a scene. LOD + consist by applying a skeleton on a 3D mesh at low resolution. And measure different between two match allow to compare different solutions of simplification.
منابع مشابه
Computation of Layered Reeb Graphs ∗
Reeb graphs represent the topological structure of a manifold based on a scalar-valued, sufficiently smooth function defined on it. The use of more than one function leads to Reeb spaces, which are thus able to capture more features of an object. The structure of the Reeb space of a 3-manifold with boundary with respect to two scalarvalued functions is captured by the layered Reeb graph. We pre...
متن کاملStrong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs
The Reeb graph is a construction that studies a topological space through the lens of a real valued function. It has been commonly used in applications, however its use on real data means that it is desirable and increasingly necessary to have methods for comparison of Reeb graphs. Recently, several metrics on the set of Reeb graphs have been proposed. In this paper, we focus on two: the functi...
متن کاملSimplified Reeb Graph as Effective Shape Descriptor for the Striatum
In this work, we present a novel image and mesh processing pipeline for the computation of simplified Reeb graphs for closed triangle meshes of the human striatum extracted from 3D-T1 weighted MR images. The method uses active contours for computing the mesh partition and the simplified Reeb graph. Experimental results showed that simplified Reeb graphs, as obtained by our pipeline, provide an ...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملStability of Reeb graphs under function perturbations: the case of closed curves
Reeb graphs provide a method for studying the shape of a manifold by encoding the evolution and arrangement of level sets of a simple Morse function defined on the manifold. Since their introduction in computer graphics they have been gaining popularity as an effective tool for shape analysis and matching. In this context one question deserving attention is whether Reeb graphs are robust agains...
متن کامل